A Hybrid Probabilistic And Combinatorial Optimization Approach To Analyzing Rowing Performance Measures
نویسندگان
چکیده
Availability of small amount of data is a major barrier that challenges data mining methods in some applications. To overcome the low accuracy problem, due to system training, we propose a novel hybrid and deterministic approach and test it on rowing championship data. Rowing is a world championship and Olympic sport which requires strategic planning. For rowers to become medallists, they need to develop plans respective to each split (generally every 500 meters). We analyzed previous rowing competition data to find the optimal combination of the rankings and times at different splits that may result in the highest chance of finishing the race in certain places. We applied our novel hybrid and deterministic approach that, given the rankings and times at each split, employs a Bayesian Belief Network to find the likelihood of each final standing occurring. Our approach then utilizes the Tabu Search discrete optimization method to find a permutation of the rankings and times that maximizes the probability of finishing in a certain position. The results of our new hybrid methodology, given the small size of the available rowing data set, are more promising for strategic rowing planning than that of traditional data mining techniques e.g., state-of-the-art machine learning-based classification methods.
منابع مشابه
A hybrid algorithm optimization approach for machine loading problem in flexible manufacturing system
The production planning problem of flexible manufacturing system (FMS) concerns with decisions that have to be made before an FMS begins to produce parts according to a given production plan during an upcoming planning horizon. The main aspect of production planning deals with machine loading problem in which selection of a subset of jobs to be manufactured and assignment of their operations to...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملA Chance Constraint Approach to Multi Response Optimization Based on a Network Data Envelopment Analysis
In this paper, a novel approach for multi response optimization is presented. In the proposed approach, response variables in treatments combination occur with a certain probability. Moreover, we assume that each treatment has a network style. Because of the probabilistic nature of treatment combination, the proposed approach can compute the efficiency of each treatment under the desirable reli...
متن کاملHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011